Hard Instances of Algorithms and Proof Systems
نویسندگان
چکیده
منابع مشابه
A Hard instances of algorithms and proof systems
A SAT-solver is an algorithm that on satisfiable propositional formulas α as input yields a satisfying assignment and that does not stop on unsatisfiable formulas. By a result due to Levin [1973] (and presented as Theorem 6.4 in this paper) we know that there is an optimal SAT-solver, that is, a SATsolver whose running time on satisfiable formulas is polynomially bounded in the running time of ...
متن کاملPseudo proof systems and hard instances of SAT ∗ – Preprint –
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. Speaking in standard terms, pseudo-proof systems are propositional proof systems that are unsound in the sense that t...
متن کاملGenerating Matrix Identities and Hard Instances for Strong Proof Systems
We study the complexity of generating identities of matrix rings. We establish an unconditional lower bound on the minimal number of generators needed to generate a matrix identity, where the generators are substitution instances of elements from any given finite basis of the matrix identities. Based on our findings, we propose to consider matrix identities (and their encoding) as hard instance...
متن کاملA remark on pseudo proof systems and hard instances of SAT∗
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. We show that the existence of mad pseudo proof systems is equivalent to the existence of a randomized polynomial time...
متن کاملHard Instances of Hard Problems
This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2014
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2601336